/**
 * Created with IntelliJ IDEA.
 * Description:矩阵的最小路径和
 * User: wangxin
 * Date: 2025-01-21
 * Time: 21:00
 */
public class Test2 {
    public int minPathSum (int[][] matrix) {
        // write code here
        int m = matrix.length;
        int n = matrix[0].length;
        int[][] dp = new int[m+1][n+1];
        dp[0][0] = matrix[0][0];
        for(int i = 1;i < m;i++){
            dp[i][0] = matrix[i][0]+dp[i-1][0];
        }
        for(int j = 1;j < n;j++){
            dp[0][j] = matrix[0][j]+dp[0][j-1];
        }
        for(int i = 1;i < m;i++){
            for(int j = 1;j < n;j++){
                dp[i][j] = matrix[i][j]+Math.min(dp[i-1][j],dp[i][j-1]);
            }
        }
        return dp[m-1][n-1];
    }
}
